Structural identification using a nonlinear constraint satisfaction processor with interval arithmetic and contractor programming
نویسندگان
چکیده
منابع مشابه
Solving Nonlinear Systems by Constraint Inversion and Interval Arithmetic
A reliable symbolic-numeric algorithm for solving nonlinear systems over the reals is designed. The symbolic step generates a new system, such the formulas are different but the solutions are preserved, through partial factorizations of polynomial expressions, and constraint inversion. The numeric step is a branch-and-prune algorithm based on interval constraint propagation to compute a set of ...
متن کاملConstraint Satisfaction Using Constraint Logic Programming
Van Hentenryck, P., H. Simonis and M. Dincbas, Constraint satisfaction using constraint logic programming, Artificial Intelligence 58 (1992) 113-159. Constraint logic programming (CLP) is a new class of declarative programming languages whose primitive operations are based on constraints (e.g. constraint solving and constraint entailment). CLP languages naturally combine constraint propagation ...
متن کاملInterval Linear Programming with generalized interval arithmetic
Generally, vagueness is modelled by a fuzzy approach and randomness by a stochastic approach. But in some cases, a decision maker may prefer using interval numbers as coefficients of an inexact relationship. In this paper, we define a linear programming problem involving interval numbers as an extension of the classical linear programming problem to an inexact environment. By using a new simple...
متن کاملConstraint Satisfaction , Constraint Programming
Recently constraint satisfaction has been embedded in various high-level declarative programming environments, like the Constraint Logic Programming framework, and even more recently such environments have been extended with concurrency, like in the Concurrent Constraint Programming paradigm. The merging of diierent areas of research is always an exciting event, and proliic of new ideas. We bel...
متن کاملSolving Constraint Satisfaction Puzzles with Constraint Programming
Constraint Programming (CP) is a powerful paradigm for solving Combinatorial Problems (generally issued from Decision Making). In CP, Enumeration Strategies are crucial for resolution performances. In this work, we model the known benchmark problems Latin Square, Magic Square and Sudoku as a Constraint Satisfaction Problems. We solve them with Constraint Programming comparing the performance of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Structures
سال: 2017
ISSN: 0045-7949
DOI: 10.1016/j.compstruc.2017.04.001